Symmetry Parameters for Mycielskian Graphs
نویسندگان
چکیده
The Mycielskian construction, denoted ?(G), takes a finite simple graph G to larger with of the same clique number but chromatic number. generalized ?t(G), odd girth. In this chapter we look at symmetry parameters ?(G) and ?t(G) in terms G. These include determining number, distinguishing cost distinguishing.
منابع مشابه
Gromov Hyperbolicity in Mycielskian Graphs
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...
متن کاملMulti-coloring the Mycielskian of graphs
A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant number: 10671033 (to W.L.); Contract grant sponsor: National Science Foundation; Contract grant number: DMS 0302456 (to D.D.L.); Contract grant sponsor: National Science Council; Contract grant number: NSC95-2115-M-110...
متن کاملSimple Graphs as Simplicial Complexes: the Mycielskian of a Graph
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of simila...
متن کاملComputing Certain Topological Indices of Generalised Mycielskian Graphs
The generalized Mycielskians are the generalization of the Mycielski graphs, which were introduced by Mycielski in 1955. A topological index is a numeric parameter mathematically derived from a graph and is invariant under automorphism of graphs. Topological indices are widely used for establishing correlations between the structure of a molecular compound and its different physico-chemical pro...
متن کاملmodular edge colorings of mycielskian graphs
let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$ ($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same. the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Association for Women in Mathematics series
سال: 2021
ISSN: ['2364-5733', '2364-5741']
DOI: https://doi.org/10.1007/978-3-030-77983-2_5